翻訳と辞書 |
Hoffman-Singleton graph : ウィキペディア英語版 | Hoffman–Singleton graph
In the mathematical field of graph theory, the Hoffman–Singleton graph is a 7-regular undirected graph with 50 vertices and 175 edges. It is the unique strongly regular graph with parameters (50,7,0,1).〔.〕 It was constructed by Alan Hoffman and Robert Singleton while trying to classify all Moore graphs, and is the highest order Moore graph known to exist.〔.〕 Since it is a Moore graph where each vertex has degree 7, and the girth is 5, it is a (7,5)-cage. ==Construction== There are many ways to construct the Hoffman-Singleton graph.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Hoffman–Singleton graph」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|